Dynamic Data Warehouse Design as a Refinement in ASM-based Approach

نویسندگان

  • Henning Köhler
  • Klaus-Dieter Schewe
  • Jane Zhao
چکیده

On-line analytical processing (OLAP) systems deal with analytical tasks in businesses. As these tasks do not depend on the latest updates by transactions, it is assumed that the data used in OLAP systems are kept in a data warehouse, which separates the input from operational databases from the outputs to OLAP. Typical OLAP queries are data intensive, and thus time consuming. In order to speed up the query computation, it is a common practice to materialize some of the computations as views based on a set of queries given. In general we wish to optimize query time under a given maintenance constraints. However, OLAP queries are not static and may change over time. Thus designing data warehouse is an ongoing task. This process is also called dynamic or incremental design. In this paper, we approach this issue as a refinement step in our Abstract State Machine (ASM) based data warehouse design, and support it by a set of standard refinement rules.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Data Warehouse Design with Abstract State Machines

On-line analytical processing (OLAP) systems deal with analytical tasks that support decision making. As these tasks do not depend on the latest updates by transactions, it is assumed that the data required by OLAP systems are kept in a data warehouse, which separates the input from operational databases from the outputs to OLAP. However, user requirements for OLAP systems change over time. Dat...

متن کامل

ASMs and Refinement of State-based Systems

My talk will present the refinement concept of abstract state machines (ASMs, [Gur95], [BS03]) that was introduced by Börger in the 90’ies ([Bör90a], [Bör90b]), when he found that traditional refinement concepts were not suitable to capture refinement in the verification of a Prolog compiler. His methodology for the use of the ASM refinement paradigm and numerous applications are described in [...

متن کامل

ASM refinement and generalizations of forward simulation in data refinement: a comparison

In [1], we have formalized Börger’s refinement notion for Abstract State Machines (ASMs). The formalization was based on transition systems, and verification conditions were expressed in Dynamic Logic. In this paper, the relation between ASM refinement and data refinement is explored. Data refinement expresses operations and verification conditions using relational calculus. We show how to brid...

متن کامل

Balancing Redundancy and Query Costs in Distributed Data Warehouses

Abstract State Machines (ASMs) encourage highlevel system specifications without forcing the development into the “formal methods straightjacket”. This makes them an ideal formal method for applications in areas, where otherwise only semi-formal methods are used. One such area is the development of data warehouse and on-line analytical processing (OLAP) applications to which this article contri...

متن کامل

The ASM Method: a Cornerstone in Computer Science Education

The versatility and wide applicability of the Abstract State Machines Method for the design and the analysis of computational systems has not yet been fully exploited for teaching. We suggest to use it for introducing basic algorithmic concepts in a succinct and uniform way, which makes the definitions adoptable in traditionally unrelated courses, covering the full range of computing science cu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007